Algorithmic Resolution of an ER Schema into Relational DDL Statements using Artificial Intelligence
نویسندگان
چکیده
The concept of this paper helps resolve an ER schema into an appropriate relational Data Description Language (herein standard SQL statements) while considering all the inherent complexity of such a schema. The algorithm resolves all the relationships between the concerned entities (even weak ones), their associated keys – primary and foreign, attributes – simple, composite and multivalued and relationships types from binary to nary. The algorithm (as implemented in ANSI C) is smart enough to consider the case of cascading weak entities.
منابع مشابه
Avoidance of Cyclical Reference of Foreign Keys in Data Modeling Using the Entity-relationship Model
The entity-relationship (ER) model is clearly established as a conceptual model of choice when building relational database systems. Once the ER model is built, it can be mapped algorithmically to the relational model and consequently to the data definition language (DDL) of SQL. Algorithmic mapping of the ER model to the relational model can produce foreign keys referencing each other’s tables...
متن کاملExtracting an Entity Relationship Schema from a Relational Database through Reverse Engineering
This paper presents a method for extracting a conceptual schema from a relational database. The method is based on an analysis of data manipulation statements in the code of an application using a relational DBMS. Attributes representing references between tables in the relational schema, and possible keys are determined by an analysis of join conditions in queries and view deenitions. Knowledg...
متن کاملCooperative Relational Database Querying Using Multiple Knowledge Bases
Copyright © 1999, American Association for Artificial Intelligence (www.aaai.org). All rights reserved. +On sabbatical leave at University of Florida, IFAS-IT Abstract We present in this paper an approach for providing cooperativeness in database querying using artificial intelligence techniques. The main focus is a cooperative interface that assists non-experienced and casual users in extracti...
متن کاملSorted Neighborhood for the Semantic Web
Entity Resolution (ER) concerns identifying logically equivalent entity pairs across databases. To avoid Θ(n) pairwise comparisons of n entities, blocking methods are used. Sorted Neighborhood is an established blocking method for relational databases. It has not been applied on graph-based data models such as the Resource Description Framework (RDF). This poster presents a modular workflow for...
متن کاملRelational Database Design Using an ER Approach and Prolog
In the context of CASE tool development for relational database design, this paper develops a methodology that maps an enhanced Entity-Relationship (ER) schema into a relational schema and normalizes the latter into inclusion normal form (IN-NF). Unlike classical normaliza-tion that characterizes individual relations only, IN-NF concerns inter-relational redundancies. The paper formalizes sourc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011